Solving parametric polynomial systems
نویسندگان
چکیده
We present a new algorithm for solving basic parametric constructible or semi-algebraic systems like C = {x ∈ C, p1(x) = 0, , ps(x) = 0, f1(x) 0, , fl(x) 0} or S = {x ∈ R, p1(x) = 0, , ps(x) = 0, f1(x)> 0, , fl(x)> 0}, where pi, fi ∈Q[U , X], U = [U1, , Ud] is the set of parameters and X = [Xd+1, , Xn] the set of unknowns. If ΠU denotes the canonical projection onto the parameter’s space, solving C or S is reduced to the computation of submanifolds U ⊂C (resp. U ⊂R) such that (Π U (U)∩C , ΠU) is an analytic covering of U (we say that U has the (ΠU , C)-covering property ). This guarantees that the cardinality of ΠU (u) ∩ C is constant on a neighborhood of u, that ΠU (U) ∩ C is a finite collection of sheets and that ΠU is a local diffeomorphism from each of these sheets onto U . We show that the complement in ΠU(C) (the closure of ΠU(C) for the usual topology of C) of the union of the open subsets of ΠU(C) which have the (ΠU , C)-covering property is a Zariski closed and thus is the minimal discriminant variety of C wrt. ΠU, denoted WD. We propose an algorithm to compute WD efficiently. The variety WD can then be used to solve the parametric system C (resp. S) as long as one can describe ΠU(C) \WD (resp. R d ∩ (ΠU(C) \WD)), which can be done by using critical points method or an ”open” Cylindrical Algebraic Variety.
منابع مشابه
Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملSolving Parametric Polynomial Equations and Inequalities by Symbolic Algorithms
The talk gives a survey on some symbolic algorithmic methods for solving systems of algebraic equations with special emphasis on parametric systems. Besides complex solutions I consider also real solutions of systems including inequalities. The techniques described include the Euclidean algorithm, Grr obner bases, characteristic sets, univariate and multivariate Sturm-Sylvester theorems, compre...
متن کاملA note on Solving Parametric Polynomial Systems
Lazard and Rouillier in [9], by introducing the concept of discriminant variety, have described a new and efficient algorithm for solving parametric polynomial systems. In this paper we modify this algorithm, and we show that with our improvements the output of our algorithm is always minimal and it does not need to compute the radical of ideals.
متن کاملOn Solving Parametric Polynomial Systems
Border polynomial and discriminant variety are two important notions related to parametric polynomial system solving, in particular, for partitioning the parameter values into regions where the solutions of the system depend continuously on the parameters. In this paper, we study the relations between those notions in the case of parametric triangular systems. We also investigate the properties...
متن کاملAn algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations
This paper presents a new algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations. This algorithm is based on the computation of what we call parametric U -resultants. The parameters space, i.e., the set of values of the parameters is decomposed into a finite number of constructible sets. The solutions of the input polynomial system are given uniformly in e...
متن کاملA New Maple Package for Solving Parametric Polynomial Systems
A new Maple package RootFinding[Parametric]for solving parametric systems of polynomial equations and inequalities is described. The main idea for solving such a system is as follows. The parameter space R is divided into two parts: the discriminant variety W and its complement Rd\W . The discriminant variety is a generalization of the well-known discriminant of a univariate polynomial and cont...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 42 شماره
صفحات -
تاریخ انتشار 2007